Interprocedural analyses: a comparison
نویسندگان
چکیده
منابع مشابه
Interprocedural Analyses: A Comparison
We present a framework for program analysis of languages with procedures which is general enough to allow for a comparison of various approaches to interproce-dural analysis. Our framework is based on a small-step operational semantics and subsumes both frameworks for imperative and for logic languages. We consider reachability analysis, that is, the problem of approximating the sets of program...
متن کاملA Generic Framework for Interprocedural Analyses of Numerical Properties
Relations among program variables like 1 + 3 · x1 + 5 · x2 ≡ 0 [224] have been called linear congruence relations. Such a relation is valid at a program point iff it is satisfied by all reaching program states. Knowledge about non-trivial valid congruence relations is crucial for various aggressive program transformations. It can also form the backbone of a program correctness proof. In his sem...
متن کاملEfficient Computation of Parameterized Pointer Information for Interprocedural Analyses
This paper presents a modular algorithm that efficiently computes parameterized pointer information, in which symbolic names are introduced to identify memory locations whose addresses may be passed into a procedure. Parameterized pointer information can be used by a client program analysis to compute parameterized summary information for a procedure. The client can then instantiate such inform...
متن کاملA comparison of algorithms for interprocedural class analysis
Message passing overhead is often a substantial source of runtime overhead in object-oriented applications. To combat this performance problem, a number of techniques have been developed to convert message sends into statically-bound procedure calls, which are then amenable to traditional compiler optimizations such as inline expansion. In this paper, we examine one such technique, interprocedu...
متن کاملTowards a tool kit for the automatic generation of interprocedural data flow analyses
Frameworks for interprocedural data ow analysis (DFA) often have a foundational character: designing concrete applications requires usually a deep understanding of the framework. Here, we reconsider interprocedural DFA from an application-oriented point of view, where all details irrelevant for application are hidden. In this view the underlying framework, which captures programs with mutually ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 2000
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(99)00058-8